Cyclic Codes over Fp + uFp+ ··· +uk-1 Fp
نویسندگان
چکیده
SUMMARY The ring F p + uF p + · · · + u k−1 F p may be of interest in coding theory, which have already been used in the construction of optimal frequency-hopping sequence. In this work, cyclic codes over F p + uF p + · · ·+u k−1 F p which is an open problem posed in [1] are considered. Namely, the structure of cyclic code over F p + uF p + · · · + u k−1 F p and that of their duals are derived.
منابع مشابه
Cyclic Codes over the Matrix Ring $M_2(\FFF_p)$ and Their Isometric Images over $\FFF_{p^2}+u\FFF_{p^2}$
Let Fp be the prime field with p elements. We derive the homogeneous weight on the Frobenius matrix ring M2(Fp) in terms of the generating character. We also give a generalization of the Lee weight on the finite chain ring Fp2+uFp2 where u 2 = 0. A non-commutative ring, denoted by Fp2+vpFp2 , vp an involution in M2(Fp), that is isomorphic to M2(Fp) and is a left Fp2vector space, is constructed ...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملTrace Codes with Few Weights over $\mathbb{F}_p+u\mathbb{F}_p$
We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the chain ring Fp+uFp. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. Then by using a linear Gray map, we obtain an infinite family of abelian codes with few weights over Fp. In particular, we obtain an infinite family of two-weight codes which me...
متن کاملTwo-weight and three-weight codes from trace codes over
We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring Fp+uFp+ vFp+uvFp, where u 2 = 0, v = 0, uv = vu. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. With a linear Gray map, we obtain a class of abelian three-weight codes and two-weight codes...
متن کاملA class of p-ary cyclic codes and their weight enumerators
Let m, k be positive integers such that m gcd(m,k) ≥ 3, p be an odd prime and π be a primitive element of Fpm. Let h1(x) and h2(x) be the minimal polynomials of −π−1 and π pk+1 2 over Fp, respectively. In the case of odd m gcd(m,k) , when k is even, gcd(m,k) is odd or when k gcd(m,k) is odd, Zhou et al. in [25] obtained the weight distribution of a class of cyclic codes C over Fp with parity-ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 88-A شماره
صفحات -
تاریخ انتشار 2005